Improving quantum clocks via semidefinite programming
نویسندگان
چکیده
منابع مشابه
Designing optimal quantum detectors via semidefinite programming
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing between a collection of quantum states, represented by a set of density operators. We show that the design of the optimal detector can be formulated as a semidefinite programming problem. Based on this formulation, we derive a set of necessary and sufficient cond...
متن کاملFinite quantum tomography via semidefinite programming
Using the the convex semidefinite programming method and superoperator formalism we obtain the finite quantum tomography of some mixed quantum states such as: qudit tomography, N-qubit tomography, phase tomography and coherent spin state tomography, where that obtained results are in agreement with those of References [21, 24, 25, 4, 26].
متن کاملQuantum algorithms for the ordered search problem via semidefinite programming
Andrew M. Childs,* Andrew J. Landahl, and Pablo A. Parrilo Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125, USA Center for Advanced Studies, Department of Physics and Astronomy, University of New Mexico, Albuquerque, New Mexico 87131, USA Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachus...
متن کاملStructural Design via Semidefinite Programming
We consider a general problem of Structural Design and demonstrate that under mild assumptions it can be posed as a Semidefinite program. The approach in question allows for unified treatment of single-load/multi-load Truss and Shape design with and without obstacles, same as for obstacle-free robust Truss and Shape design. We present three equivalent Semidefinite formulations of the Structural...
متن کاملProduct Theorems Via Semidefinite Programming
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovász to determine the Shannon capacity of the pentagon; to show a direct sum theorem for non-deterministic communication complexity and direct product theorems for discrepancy; and in interactive proof systems to show parallel repetition theorems for res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2012
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic12.7-8-2